Size-constrained graph partitioning polytope. Part I: Dimension and trivial facets
نویسندگان
چکیده
We consider the problem of clustering a set of items into subsets whose sizes are bounded from above and below. We formulate the problem as a graph partitioning problem and propose an integer programming model for solving it. This formulation generalizes several well-known graph partitioning problems from the literature like the clique partitioning problem, the equi-partition problem and the k-way equi-partition problem. In this paper and its sequel, we analyze the structure of the corresponding polytope and prove several results concerning the facial structure. Our analysis yields important results for the closely related equi-partition and k-way equi-partition polytopes as well.
منابع مشابه
Size-constrained graph partitioning polytope. Part II: Non-trivial facets
We consider the problem of clustering a set of items into subsets whose sizes are bounded from above and below. We formulate the problem as a graph partitioning problem and propose an integer programming model for solving it. This formulation generalizes several well-known graph partitioning problems from the literature like the clique partitioning problem, the equi-partition problem and the k-...
متن کاملPolytopes of partitions of numbers
We study the vertices and facets of the polytopes of partitions of numbers. The partition polytope n P is the convex hull of the set of incidence vectors of all partitions 1 2 2 ... n n x x nx = + + +. We show that the sequence 1 2 n P P P can be treated as an embedded chain. Dynamics of behavior of the vertices of n P , as n increases, is established. Some sufficient and some necessary conditi...
متن کاملA counterexample to the Hirsch conjecture
The Hirsch Conjecture (1957) stated that the graph of a d-dimensional polytope with n facets cannot have (combinatorial) diameter greater than n−d. That is, any two vertices of the polytope can be connected by a path of at most n− d edges. This paper presents the first counterexample to the conjecture. Our polytope has dimension 43 and 86 facets. It is obtained from a 5-dimensional polytope wit...
متن کاملSize - constrained graph partitioning polytope
We consider the problem of clustering a set of items into subsets whose sizes are bounded from above and below. We formulate the problem as a graph partitioning problem and propose an integer programming model for solving it. This formulation generalizes several well-known graph partitioning problems from the literature like the clique partitioning problem, the equi-partition problem and the k-...
متن کاملMore facets from fences for linear ordering and acyclic subgraph polytopes
We present new facets for the linear ordering polytope. These new facets generalize facets induced by subgraphs called fences, introduced by Grijtschel et al. (1985) and augmented fences, introduced by McLennan (1990). One novelty of the facets introduced here is that each subgraph induces not one but a family of facets, which are not generally rank inequalities. Indeed, we provide the smallest...
متن کامل